Sparse Gaussian Processes Using Backward Elimination
نویسندگان
چکیده
Gaussian Processes (GPs) have state of the art performance in regression. In GPs, all the basis functions are required for prediction; hence its test speed is slower than other learning algorithms such as support vector machines (SVMs), relevance vector machine (RVM), adaptive sparseness (AS), etc. To overcome this limitation, we present a backward elimination algorithm, called GPs-BE that recursively selects the basis functions for GPs until some stop criterion is satisfied. By integrating rank-1 update, GPs-BE can be implemented at a reasonable cost. Extensive empirical comparisons confirm the feasibility and validity of the proposed algorithm.
منابع مشابه
Parallel Modular Dynamic Process Simulation ?
To meet the needs of plant wide dynamic process simulation of today's complex, highly interconnected chemical production plants, parallelizable numerical methods using divide and conquer strategies are considered. The large systems of di erential algebraic equations (DAE's) arising from an unit oriented modular modeling of chemical and physical processes in a chemical plant are partitioned into...
متن کاملExtending the pivoting strategy of Backward IJK version of Gaussian Elimination to an IUL preconditioner
Consider the linear system of equations of the form Ax = b where the coefficient matrix A ∈ Rn×n is nonsingular, large, sparse and nonsymmetric and also x, b ∈ R. We refer to this system as the original system. An explicit preconditioner M for this system is an approximation of matrix A−1. In [1], Lou presented the Backward Factored INVerse or BFINV algorithm which computes the inverse factoriz...
متن کاملDirect linear time solvers for sparse matrices
In the last couple of years it has been realized that Gaussian elimination for sparse matrices arising from certain elliptic PDEs can be done in O(n log(1/ )) flops, where n is the number of unknowns and is a user-specified tolerance [Chandrasekaran and Gu]. The resulting solver will also be backward stable with an error of O( ). The techniques used to achieve this speedup has some commonality ...
متن کاملParallelized numerical methods for large systems of differential–algebraic equations in industrial applications
Based on a hierarchical modular modeling the large nonlinear systems of differential algebraic equations arising from industrial applications in electric circuit simulation or in dynamic process simulation of chemical plants can be structured into subsystems. Parallelized numerical methods for solving such systems are considered at the level of nonlinear and linear equations. Merging subsystems...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کامل